Algebraic and combinatorial expansion in random simplicial complexes

نویسندگان

چکیده

In this paper we consider the expansion properties and spectrum of combinatorial Laplace operator a d-dimensional Linial–Meshulam random simplicial complex, above cohomological connectivity threshold. We spectral gap Cheeger constant as was introduced by Parzanchevski, Rosenthal, Tessler. show that with high probability complex well are both concentrated around minimum co-degree among all -faces. Furthermore, walk on such which generalizes standard graph. associated conductance is bounded away from 0, resulting in bound mixing time logarithmic number vertices complex.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponential random simplicial complexes

Abstract Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles subject to the constraints that the expected values of a set of graph observables are equal to given values. Here we extend these maximum-entropy ensembles to random simplicial complexes, which are more adequate and versatile constructions to m...

متن کامل

Algebraic fundamental group and simplicial complexes

In this paper we prove that the fundamental group of a simplicial complex is isomorphic to the algebraic fundamental group of its incidence algebra, and we derive some applications. AMS classification : 16E40 ; 16G20 ; 06A11 ; 55Q05 Let k be a field and A be a basic and split finite dimensional k-algebra, which means that A/r = k× k× . . .× k where r is the radical of A. There exists a unique q...

متن کامل

Cohen-Macaulay-ness in codimension for simplicial complexes and expansion functor

In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $tgeq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we provethat it can be obtained from a Buchsbaum complex.

متن کامل

Random Abstract Simplicial Complexes Reduction

Random abstract simplicial complex representation provides a mathematical description of wireless networks and their topology. In order to reduce the energy consumption in this type of network, we intend to reduce the number of network nodes without modifying neither the connectivity nor the coverage of the network. In this paper, we present a reduction algorithm that lower the number of points...

متن کامل

Combinatorial Hopf Algebras of Simplicial Complexes

We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combinatorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial complexes and their f -vectors. We al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Random Structures and Algorithms

سال: 2021

ISSN: ['1042-9832', '1098-2418']

DOI: https://doi.org/10.1002/rsa.21036